Visibility polygon

Results: 33



#Item
21CCCG 2011, Toronto ON, August 10–12, 2011 Weak Visibility Queries in Simple Polygons Mojtaba Nouri Bygi ∗

CCCG 2011, Toronto ON, August 10–12, 2011 Weak Visibility Queries in Simple Polygons Mojtaba Nouri Bygi ∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:16
22CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Optimal schedules for 2-guard room search Stephen Bahun∗ Abstract

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Optimal schedules for 2-guard room search Stephen Bahun∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:30:44
23CCCG 2011, Toronto ON, August 10–12, 2011 Weak Visibility Queries in Simple Polygons Mojtaba Nouri Bygi ∗

CCCG 2011, Toronto ON, August 10–12, 2011 Weak Visibility Queries in Simple Polygons Mojtaba Nouri Bygi ∗

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:16
24CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Optimal schedules for 2-guard room search Stephen Bahun∗ Abstract

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Optimal schedules for 2-guard room search Stephen Bahun∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:26:35
25CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon Amir Ali Khosravi∗†

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon Amir Ali Khosravi∗†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:27:01
26CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Generalized Watchman Route Problem with Discrete View Cost Pengpeng Wang∗, 1

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Generalized Watchman Route Problem with Discrete View Cost Pengpeng Wang∗, 1

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:28:16
27CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the Chromatic Art Gallery Problem S´ andor P. Fekete∗

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the Chromatic Art Gallery Problem S´ andor P. Fekete∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2014-06-21 09:31:52
28How many landmark colors are needed to avoid confusion in a polygon? Lawrence H. Erickson and Steven M. LaValle Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL[removed]USA {lericks4, la

How many landmark colors are needed to avoid confusion in a polygon? Lawrence H. Erickson and Steven M. LaValle Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL[removed]USA {lericks4, la

Add to Reading List

Source URL: msl.cs.uiuc.edu

Language: English - Date: 2011-10-14 01:38:18
29Glossary Aliasing—Jagged edges that appear in the rendering of polygon edges. Alpha blending—Blending of transparent to non-transparent areas in materials. Alpha value—The visibility of a renderer, often used to fa

Glossary Aliasing—Jagged edges that appear in the rendering of polygon edges. Alpha blending—Blending of transparent to non-transparent areas in materials. Alpha value—The visibility of a renderer, often used to fa

Add to Reading List

Source URL: www.packtpub.com

Language: English
30A New Algorithm for 3D Isovist SULEIMAN Wassim a, JOLIVEAU Thiery a, FAVIER Eric b a ISTHME -EVS CNRS UMR 5600, Université Jean Monnet - Saint-Etienne. E-mail: {wassim.suleiman,thierry.joliveau}@univ-st-etienne.fr.

A New Algorithm for 3D Isovist SULEIMAN Wassim a, JOLIVEAU Thiery a, FAVIER Eric b a ISTHME -EVS CNRS UMR 5600, Université Jean Monnet - Saint-Etienne. E-mail: {wassim.suleiman,thierry.joliveau}@univ-st-etienne.fr.

Add to Reading List

Source URL: georeseau.net

Language: English - Date: 2012-09-06 05:42:40